from search     import beam_search
from problems   import parse_problem
from heuristics import manhattan_dirt
import graphic_problems
from beamsearch_solution import beam_solution
from src.beamsearch_solution import beam_solution



p = parse_problem(graphic_problems.p6)
print p

for i in range(20):
    print beam_solution(manhattan_dirt(),25).solve(p, i/100)
